Exact Arithmetic at Low Cost - A Case Study in Linear Programming

نویسنده

  • Bernd Gärtner
چکیده

We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is an implementation of the simplex method which combines exact (multiple precision) arithmetic with inexact (floating point) arithmetic, where the number of exact arithmetic operations is small and usually bounded by a function of min(n,m). Combining this with a “partial pricing” scheme (based on a result by Clarkson) which is particularly tuned for the problems under consideration, we obtain a correct and practically efficient algorithm that even competes with the inexact state-of-the-art solver CPLEX for small values of min(n,m) and and is far superior to methods that use exact arithmetic in any operation. The main applications lie in computational geometry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A LINEAR PROGRAMMING MODEL FOR PRODUCTION PLANNING: AN IRANIAN CASE STUDY IN CEMENT

Production planning and inventory control efforts are known as the driving engines of manufacturing systems. The manufacturers, competing to survive in these days’ competitive business environment, aim to satisfy customers’ needs. This requires a precise production plan throughout the supply chain. These days, because of the increasing costs of production and distribution, especially in the cem...

متن کامل

Efficient computation of exact solutions for quantitative model checking

Quantitative model checkers for Markov Decision Processes typically use finite-precision arithmetic, since exact techniques are generally too expensive or limited in scalability. In this paper we propose a method for obtaining exact results starting from an approximated solution in finite-precision arithmetic. The input of the method is a description of a scheduler, which can be obtained by a m...

متن کامل

A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants

In this article, we propose a special case of two-echelon location-routing problem (2E-LRP) in cash-in-transit (CIT) sector. To tackle this realistic problem and to make the model applicable, a rich LRP considering several existing real-life variants and characteristics named BO-2E-PCLRPSD-TW including different objective functions, multiple echelons, multiple periods, capacitated vehicles, dis...

متن کامل

Modeling and Optimization of Truck-Shovel Allocation to Mining Faces in Cement Quarry

Truck and shovel are the most common raw material transportation system used in the cement quarry operations. One of the major challenges associated with the cement quarry operations is the efficient allocation of truck and shovel to the mining faces. In order to minimize the truck and shovel operating cost, subject to quantity and quality constraints, the mixed integer linear programing (MILP)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Geom.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1998